Focalization and phase models for classical extensions of non-associative Lambek calculus

نویسنده

  • Arno Bastenhof
چکیده

Lambek’s non-associative syntactic calculus (NL, [18]) excels in its resource consciousness: the usual structural rules for weakening, contraction, exchange and even associativity are all dropped. Recently, there have been proposals for conservative extensions dispensing with NL’s intuitionistic bias towards sequents with single conclusions: De Groote and Lamarche’s classical NL (CNL, [10]) and Moortgat’s Lambek-Grishin calculus (LG, [21]). We demonstrate Andreoli’s focalization property ([2]) for said proposals: a normalization result for Cut-free sequent derivations identifying to a large extent those differing only by trivial rule permutations. In doing so, we proceed from a ‘uniform’ sequent presentation, deriving CNL from LG through the addition of structural rules. The normalization proof proceeds by the construction of syntactic phase models wherein every ‘truth’ has a focused proof, similar to [23].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lambek Calculus with Nonlogical Axioms

We study Nonassociative Lambek Calculus and Associative Lambek Calculus enriched with finitely many nonlogical axioms. We prove that the nonassociative systems are decidable in polynomial time and generate context-free languages. In [Buszkowski 1982] it has been shown that finite axiomatic extensions of Associative Lambek Calculus generate all recursively enumerable languages; here we give a ne...

متن کامل

Rigid grammars in the Associative-Commutative Lambek Calculus are not learnable

In (Kanazawa, 1998) it was shown that rigid Classical Categorial Grammars are learnable (in the sense of (Gold, 1967)) from strings. Surprisingly there are recent negative results for, among others, rigid associative Lamb ek (L) grammars. In this paper the non-lcarnability of the class of rigid grammars in LP (Associative-Commutative Lambek calculus) and LP0 (same, but allowing the empty sequen...

متن کامل

Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic

We show that the relational semantics of the Lambek calculus, both nonassociative and associative, is also sound and complete for its extension with classical propositional logic. Then, using filtrations, we obtain the finite model property for the nonassociative Lambek calculus extended with classical propositional logic.

متن کامل

k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures

This paper is concerned with learning categorial grammars from positive examples in the model of Gold. Functor-argument structures (written FA) are usual syntactical decompositions of sentences in sub-components distinguishing the functional parts from the argument parts defined in the case of classical categorial grammars also known as AB-grammars. In the case of non-associative type-logical g...

متن کامل

The Non-Associative Lambek Calculus with Product in Polynomial Time

We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open prolem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1106.0399  شماره 

صفحات  -

تاریخ انتشار 2011